A low-time-complexity and secure dual-field scalar multiplication based on co-Z protected NAF

نویسندگان

  • Jizeng Wei
  • Xulong Liu
  • Hao Liu
  • Wei Guo
چکیده

In this paper, we incorporate the co-Z arithmetic with Protected NAF to build a dual-field scalar multiplication method in ECC (elliptic curve cryptography) with lower time complexity and higher security, called co-Z Protected NAF. The Protected NAF is the alteration of the original NFA against SPA (simple power analysis) attack. But the employed dummy operations, double-and-add-always, often results in two severe problems: the high time complexity and the vulnerability of safe-error attack. So, the speed advantage of co-Z point addition is leveraged to greatly compensate the time penalty incurred by Protected NAF. Meanwhile, not only does the co-Z not change the SPA immunity existed in Protected NAF, but the property of updating point P in it improves the security to resist the safe-error attack. Experiment results show that the co-Z Protected NAF can obtain 1.36 times speedup with respect to Protected NAF over GF(p), and is even faster than original NAF. And it can also counteract 30.7% time loss over GF(2m) caused by dummy operations. Furthermore, because the co-Z Protected NAF is only the optimization on scalar multiplication, only less than 1% extra area cost is generated to achieve its improvements in time complexity and security.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalar Multiplication on Koblitz Curves using tau2-NAF

The paper proposes a τ−NAF method for scalar multiplication on Koblitz curves, which requires asymptotically 0.215m point additions in GF (2). For τ−NAF method, point quading operation (a→ a) is performed instead of point squarings. The proposed method is faster than normal τ−NAF method, which requires around m 3 point additions. However, like width w based τ−NAF methods, there is an overhead o...

متن کامل

Elliptic-curve scalar multiplication algorithm using ZOT structure

The computation of P over elliptic curves is the dominant operation. It depends on the representation of the scalar . The binary method is the standard unsigned method that is used to compute the elliptic curve point . Researchers found that it is not the most efficient way for implementing elliptic curve computations. Other recoding methods such as CR, NAF, and MOF were presented in order to e...

متن کامل

Co-Z Addition Formulæ and Binary Ladders on Elliptic Curves

Meloni recently introduced a new type of arithmetic on elliptic curves when adding projective points sharing the same Z-coordinate. This paper presents further co-Z addition formulæ for various point additions on Weierstraß elliptic curves. It explains how the use of conjugate point addition and other implementation tricks allow one to develop efficient scalar multiplication algorithms making u...

متن کامل

Co-Z Addition Formulæ and Binary Ladders on Elliptic Curves - (Extended Abstract)

Meloni recently introduced a new type of arithmetic on elliptic curves when adding projective points sharing the same Z-coordinate. This paper presents further co-Z addition formulæ (and register allocations) for various point additions on Weierstraß elliptic curves. It explains how the use of conjugate point addition and other implementation tricks allow one to develop efficient scalar multipl...

متن کامل

Optimizing {0, 1, 3}-NAF Recoding Algorithm Using Block-Method Technique in Elliptic Curve Cryptosystem

Corresponding Author: Mohsen Bafandehkar Department of Computer Science, University Putra Malaysia, Selangor, Malaysia Email: [email protected] Abstract: The most expensive and time-consuming operation in Elliptic curve cryptosystem is scalar multiplication operation. Optimization of scalar multiplication will substantially enhance the ECC performance. Scalar multiplication can be improved ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Electronic Express

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2014